Fast Analytic Sampling Approximation from Cauchy Kernel
نویسندگان
چکیده
منابع مشابه
R . D . Carmichael ANALYTIC FUNCTIONS , CAUCHY KERNEL , AND CAUCHY INTEGRAL IN TUBES
Analytic functions in tubes in association with ultradistributional boundary values are analyzed. Conditions are stated on the analytic functions satisfying a certain norm growth which force the functions to be in the Hardy space H2 . Properties of the Cauchy kernel and Cauchy integral are obtained which extend results obtained previously by the author and collaborators.
متن کاملDistributed Adaptive Sampling for Kernel Matrix Approximation
Most kernel-based methods, such as kernel or Gaussian process regression, kernel PCA, ICA, or k-means clustering, do not scale to large datasets, because constructing and storing the kernel matrix Kn requires at least O(n2) time and space for n samples. Recent works [1, 9] show that sampling points with replacement according to their ridge leverage scores (RLS) generates small dictionaries of r...
متن کاملCauchy Fast Multipole Method for General Analytic Kernels
The fast multipole method (FMM) is a technique allowing the fast calculation of long-range interactions between N points in O(N) or O(N logN) steps with some prescribed error tolerance. The FMM has found many applications in the field of integral equations and boundary element methods, in particular by accelerating the solution of dense linear systems arising from such formulations. Standard FM...
متن کاملFast protein fragment similarity scoring using a Binet-Cauchy kernel
MOTIVATION Meaningful scores to assess protein structure similarity are essential to decipher protein structure and sequence evolution. The mining of the increasing number of protein structures requires fast and accurate similarity measures with statistical significance. Whereas numerous approaches have been proposed for protein domains as a whole, the focus is progressively moving to a more lo...
متن کاملFast recovery and approximation of hidden Cauchy structure
We derive an algorithm of optimal complexity which determines whether a given matrix is a Cauchy matrix, and which exactly recovers the Cauchy points defining a Cauchy matrix from the matrix entries. Moreover, we study how to approximate a given matrix by a Cauchy matrix with a particular focus on the recovery of Cauchy points from noisy data. We derive an approximation algorithm of optimal com...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Function Spaces
سال: 2016
ISSN: 2314-8896,2314-8888
DOI: 10.1155/2016/5780718